Average size of random polygons with fixed knot topology
نویسندگان
چکیده
منابع مشابه
Average size of random polygons with fixed knot topology.
We have evaluated by numerical simulation the average size R(K) of random polygons of fixed knot topology K=,3(1),3(1) musical sharp 4(1), and we have confirmed the scaling law R(2)(K) approximately N(2nu(K)) for the number N of polygonal nodes in a wide range; N=100-2200. The best fit gives 2nu(K) approximately 1.11-1.16 with good fitting curves in the whole range of N. The estimate of 2nu(K) ...
متن کاملDistribution of the distance between opposite nodes of random polygons with a fixed knot
We examine numerically the distribution function f K (r) of the distance r between opposite polygonal nodes for random polygons with a fixed knot type K. Here we consider some knots such as ∅, 3 1 and 3 1 ♯3 1. In a wide range of r, the shape of f K (r) is well fit to the scaling form [1] derived from the field theory for self-avoiding walks. The fit yields the exponents ν K = 1 2 and γ K = 1, ...
متن کاملBlocks in Constrained Random Graphs with Fixed Average Degree
This work is devoted to the study of typical properties of random graphs from classes with structural constraints, like for example planar graphs, with the additional restriction that the average degree is fixed. More precisely, within a general analytic framework, we provide sharp concentration results for the number of blocks (maximal biconnected subgraphs) in a random graph from the class in...
متن کاملVertexlights with Fixed Directions in Simple Polygons
We study the problem of determining the smallest α ∈ [0, 2π] for a given simple polygon P with n vertices, such that P can be illuminated by α-vertexlights the directions of which are fixed. We present an algorithm that finds a solution to this problem in O(rn) time, where r is the number of reflex vertices of P . Furthermore we show that with the help of parametric search the problem can be so...
متن کاملFixed Topology Alignment with Recombination
In this paper, we study a new version of multiple sequence alignment, xed topology alignment with recombination. We show that it can not be approximated within any constant ratio unless P = NP. For a more restricted version, we show that the problem is MAX-SNP-hard. This implies that there is no PTAS for this version unless P = NP. We also propose approximation algorithms for a special case, wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2003
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.68.011102